Comparing Extended Z with a Heterogeneous Notation for Reasoning about Time and Space
نویسنده
چکیده
We contrast using a notation extension with using a combination of notations. Specifically, we compare the use of an extended dialect of Z [10] with a combination of Z and predicative programming notation [6] for algorithm refinement and for reasoning about time and space constraints on systems. We discuss the difficulty of using extended notations versus using heterogeneous notations, and consider when we might prefer to extend or combine notations. We conclude that there exist situations where a heterogeneous notation can be more appropriate to use than an extended notation.
منابع مشابه
Modular specification of real-time systems
Duration Calculus, a real-time interval logic, has been embedded in the Z specification language to provide a notation f o r real-time systems that combines the modularisation and abstraction facilities of Z with a logic suitable for reasoning about real-time properties [4 , 21. In this article the notation is presented through a top-level specification of requirements for a simple Air Traffic ...
متن کاملSpeciication and Reenement Using a Heterogeneous Notation for Real-time, Concurrency, and Communication Specification and Refinement Using a Heterogeneous Notation for Real-time,concurrency, and Communication
It is shown how to combine the Z formal specification notation [18] with a predicative notation [11], so as to be able to specify and reason about real-time, concurrency, and communication. The integration is carried out so as to alleviate some of the deficiencies noted with these approaches [5], such as the inability to use Z proof rules and tools. We demonstrate how to carry out refinement in...
متن کاملSPECIFICATION AND REFINEMENT USING A HETEROGENEOUS NOTATION FOR REAL - TIME , CONCURRENCY , AND COMMUNICATION Richard
It is shown how to combine the Z formal specification notation [18] with a predicative notation [11], so as to be able to specify and reason about real-time, concurrency, and communication. The integration is carried out so as to alleviate some of the deficiencies noted with these approaches [5], such as the inability to use Z proof rules and tools. We demonstrate how to carry out refinement in...
متن کاملExtended Kalman Filtering and Gaussian Belief Space Planning through Sequential Convex Programming [40pts]
In this question you get to implement an extended Kalman Filter (EKF) for state estimation for nonlinear dynamics and observation models. Notes: Let x ∈ RxDim be the system state, u ∈ RuDim denote the control input applied to the system, and z ∈ RzDim be the vector of observations obtained about the system state using sensors. We are given a discrete-time stochastic dynamics model that describe...
متن کاملThe CleanJava Language for Functional Program Verification
Unlike Hoare-style program verification, functional program verification supports forward reasoning by viewing a program as a mathematical function from one program state to another and proving its correctness by essentially comparing two mathematical functions, the function computed by the program and its specification. Since it requires a minimal mathematical background and reflects the way t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998